An Axiomatization for Cylinder Computation Model
نویسندگان
چکیده
To model and verify multi-core parallel programs, the paper proposes an axiom system for Propositional Projection Temporal Logic with Cylinder Computation Model (CCM-PPTL). To do so, the syntax and semantics of CCM-PPTL are presented. Further, based on the logical laws of PPTL, some algebraic laws of sequence expressions and logical laws regarding CCM operators are proved. Moreover, the axiom system of CCM-PPTL is established by extending that of PPTL with some axioms and inference rules of CCM operators. In addition, the soundness and completeness of the system are proved.
منابع مشابه
External and Internal Incompressible Viscous Flows Computation using Taylor Series Expansion and Least Square based Lattice Boltzmann Method
The lattice Boltzmann method (LBM) has recently become an alternative and promising computational fluid dynamics approach for simulating complex fluid flows. Despite its enormous success in many practical applications, the standard LBM is restricted to the lattice uniformity in the physical space. This is the main drawback of the standard LBM for flow problems with complex geometry. Several app...
متن کاملTwo Phase Flow Simulation for Subcooled Nucleat Boiling Heat Transfer Calculation in Water Jacket of Diesel Engine
Basic understanding of the process of coolant heat transfer inside an engine is an indispensable prerequisite to devise an infallible cooling strategy. Coolant flow and its heat transfer affect the cooling efficiency, thermal load of heated components, and thermal efficiency of a diesel engine. An efficient approach to studying cooling system for diesel engine is a 3D computational fluid dynami...
متن کاملInternal combustion engines in cylinder flow simulation improvement using nonlinear k-ε turbulence models
The purpose of this paper is to studying nonlinear k-ε turbulence models and its advantages in internal combustion engines, since the standard k-ε model is incapable of representing the anisotropy of turbulence intensities and fails to express the Reynolds stresses adequately in rotating flows. Therefore, this model is not only incapable of expressing the anisotropy of turbulence in an engine c...
متن کاملAn Axiomatization of Full Computation Tree Logic
We give a sound and complete axiomatization for the full computation tree logic, CTL*, of R-generable models. This solves a long standing open problem in branching time temporal logic. ?
متن کاملAn algebra of reversible computation
We design an axiomatization for reversible computation called reversible ACP (RACP). It has four extendible modules: basic reversible processes algebra, algebra of reversible communicating processes, recursion and abstraction. Just like process algebra ACP in classical computing, RACP can be treated as an axiomatization foundation for reversible computation.
متن کامل